Rank-width: Algorithmic and structural results
نویسندگان
چکیده
منابع مشابه
Rank-width: Algorithmic and structural results
Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by ‘simple’ cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs.
متن کاملThread Graphs, Linear Rank-Width and Their Algorithmic Applications
Many NP-hard graph problems can be efficiently solved on graphs of bounded tree-width. Several articles have recently shown that the so-called rank-width parameter also allows efficient solution of most of these NP-hard problems, while being less restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard on graphs of bounded rank-width...
متن کاملRank-width and vertex-minors
The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...
متن کاملComputing rank-width exactly
We prove that the rank-width of an n-vertex graph can be computed exactly in time O(2n log n log log n). To improve over a trivial O(3 log n)-time algorithm, we develop a general framework for decompositions on which an optimal decomposition can be computed efficiently. This framework may be used for other width parameters, including the branch-width of matroids and the carving-width of graphs....
متن کاملFolding a Triangulated Simple Polygon: Structural and Algorithmic Results
We describe a linear-time algorithm that folds a triangulated simple polygon into a single triangle. Using this technique, we derive a particularly simple proof of Chvv atal's art gallery theorem and improve or simplify a number of algorithms that deal with triangulated simple polygons. We describe two improved algorithms, both based on the degree sequence of the boundary vertices of the given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.08.006